Arithmetic coding for finite-state noiseless channels
نویسندگان
چکیده
We analyze the expected delay for infinite precision arithmetic codes, and suggest a practical implementation that closely approximates the idealized infinite precision model.
منابع مشابه
Simple Proofs of Some Theorems on Noiseless Channels
Shannon's capacity formula for memoryless and finite-state noiseless channels is proved in a simple elementary way, for arbitrary symbol costs; actually, a somewhat stronger result is proved. Further, a simple proof of a version of the noiseless coding theorem is given, based on the properties of entropy and avoiding combinatorial arguments; also, in the familiar proof of the mentioned theorem,...
متن کاملAn implementation of Elias coding for input-restricted channels
An implementation of Elias coding for input-restricted channels is presented and analyzed. This is a variable-to-fixed length coding method that uses finite-precision arithmetic and can work at rates arbitrarily close to channel capacity as the precision is increased. The method offers a favorable tradeoff between complexity and coding efficiency. For example, in experiments with the [2, 71 run...
متن کاملSynchronous Bounded Delay Coding for Input Restricted Channels
Consider the class of input restricted channels whose constraints can be modelled by$nite state machines. This paper treats the problem o f constructing3xed rate (synchronous) codes for such channels subject to a constraint that the coding delay be bounded by a parameter M. M is the maximum number o f information symbols required by the coder in choosing a word during transmission. 1. Introduct...
متن کاملA framework for low-complexity communication over channels with feedback
This thesis develops a framework for low-complexity communication over channels with feedback. In this framework, which is referred to in the thesis as the compressed-error-cancellation framework, data are sent via a sequence of messages: the first message contains the original data; each subsequent message contains a source-coded description of the channel distortions introduced on the message...
متن کاملA progressive universal noiseless coder
AbstructWe combine pruned tree-structured vector quantization (pruned TSVQ) with Itoh’s universal noiseless coder. By combining pruned TSVQ with universal noiseless coding, we benefit from the “successive approximation” capabilities of TSVQ, thereby allowing progressive transmission of images, while retaining the ability to noiselessly encode images of unknown statistics in a provably asymptoti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 40 شماره
صفحات -
تاریخ انتشار 1994